Strong noise sensitivity and random graphs
نویسندگان
چکیده
منابع مشابه
Strong Noise Sensitivity and Random Graphs
The noise sensitivity of a Boolean function describes its likelihood to flip under small perturbations of its input. Introduced in the seminal work of Benjamini, Kalai and Schramm (1999), it was there shown to be governed by the first level of Fourier coefficients in the central case of monotone functions at a constant critical probability pc. Here we study noise sensitivity and a natural stron...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملThe Strong Chromatic Index of Random Graphs
The strong chromatic index of a graph G, denoted by χs(G), is the minimum number of colors needed to color its edges so that each color class is an induced matching. In this paper we analyze the asymptotic behavior of this parameter in a random graph G(n, p), for two regions of the edge probability p = p(n). For the dense case, where p is a constant, 0 < p < 1, we prove that with high probabili...
متن کاملStrong approximation in random towers of graphs
The term strong approximation is used to describe phenomena where an arithmetic group as well as all of its Zariski dense subgroups have a large image in the congruence quotients. We exhibit analogues of such phenomena in a probabilistic, rather than arithmetic, setting. Let T be the binary rooted tree, Aut(T ) its automorphism group. To a given m-tuple a = {a1, a2, . . . , am} ∈ Aut(T ) we ass...
متن کاملStrong Games Played on Random Graphs
Did you ever play games such as Tic-Tac-Toe, its close relative n-in-a-row or Hex? Then you are already familiar with strong games. Strong games, as a specific type of Positional games, involve two players alternately claiming unoccupied elements of a set X, which is referred to as the board of the game. The two players are called Red (the first player) and Blue (the second player). The focus o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2015
ISSN: 0091-1798
DOI: 10.1214/14-aop959